Good friends are hard to nd !

نویسندگان

  • Thomas Brihaye
  • Mohamed Ghannem
  • Nicolas Markey
  • Lionel Rieg
چکیده

We focus on the problem of finding (the size of) a minimal winning coalition in a multi-player game. We prove that deciding whether there is a winning coalition of size at most k is NP-complete, while deciding whether k is the optimal size is DP-complete. We also study different variants of our original problem: the function problem, where the aim is to effectively compute the coalition; more succinct encoding of the game; and richer families of winning objectives.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Colour Emotion Models, CIELAB Colour Coordinates, and Iranian Emotional Responses

Ten colour emotional scales, namely, "Warm Cool", "Active-Passive", "Like-Dislike", "Clean-Dirty", "Fresh-Stale", "Modern-Classical", "Heavy-Light", "Hard- Soft", "Tense-Relaxed", and "Masculine-Feminine"are investigated for single-colour stimuli in CIELAB colour space within a psychophysical experiment by forty observers. The relationships between Iranian colour emotional responses and CIELAB ...

متن کامل

Effect of Post-Sintering Annealing Treatment on Magnetic Properties of Some Nd Fe b Based Magnets

Effects of post-sintering annealing treatment between 300 and 1000ºC for up to 8 hrs time periods followed by either furnace cooling (FC) or air-cooling (AC) on the hard magnetic properties of some Nd-Fe-B based sintered magnets was investigated. It was shown that the intrinsic coercivity (Hci), second quadrant demagnetization loop shape and thus the energy density (BH)max varied considerably a...

متن کامل

Graph Partitioning for Dynamic, Adaptive, and Multi-phase Computations

Algorithms that nd good partitionings of highly unstructured graphs are critical in developing eÆcient algorithms for problems in a variety of domains such as scienti c simulations that require solution to large sparse linear systems, VLSI design, and data mining. Even though this problem is NP-hard, eÆcient multi-level algorithms have been developed that can nd good partitionings of static irr...

متن کامل

Resource-bounded Belief Revision Illc Dissertation Series 2000-01 Resource-bounded Belief Revision 8 Discussion and Future Work 115 a Full Acceptance via Argumentation 119

The investigations were supported by CAPES (Fundaa c~ ao Coordenaa c~ ao de Aper-feii coamento de Pessoal de N vel Superior). \Don't be in such a hurry to believe next time | I'll tell you why | If you set to work to believe everything , you will tire out the muscles of your mind, and then you'll be so weak you won't be able to believe the simplest true things. Only last week a friend of mine s...

متن کامل

Molecular dynamics simulation of a binary mixture lubricant for use in hard disk interfaces

In Hard Disk Drives (HDD), it is necessary to decrease the Flying Height (FH) between the head and the disk (currently, FH is around 3-5 nm) so as to increase recording densities. Retaining the solid lubricant has become a difficult proposition owing to intermittent contact between the surfaces. ZTMD and Z are used as solid lubricant to lubricate these interfaces. In this paper, the behavior of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008